Approximate optimal stopping of dependent sequences
نویسندگان
چکیده
منابع مشابه
Approximate Solutions to Optimal Stopping Problems
We propose and analyze an algorithm that approximates solutions to the problem of optimal stopping in a discounted irreducible aperiodic Markov chain. The scheme involves the use of linear combinations of fixed basis functions to approximate a Q-function. The weights of the linear combination are incrementally updated through an iterative process similar to Q-Iearning, involving simulation of t...
متن کاملOptimal Stopping Policy for Multivariate Sequences a Generalized Best Choice Problem
In the classical versions of “Best Choice Problem”, the sequence of offers is a random sample from a single known distribution. We present an extension of this problem in which the sequential offers are random variables but from multiple independent distributions. Each distribution function represents a class of investment or offers. Offers appear without any specified order. The objective is...
متن کاملEarly Stopping and Non-parametric Regression: An Optimal Data-dependent Stopping Rule
Early stopping is a form of regularization based on choosing when to stop running an iterative algorithm. Focusing on non-parametric regression in a reproducing kernel Hilbert space, we analyze the early stopping strategy for a form of gradient-descent applied to the least-squares loss function. We propose a data-dependent stopping rule that does not involve hold-out or cross-validation data, a...
متن کاملParameter - dependent optimal stopping problems for one - dimensional diffusions ∗
We consider a class of optimal stopping problems for a regular one-dimensional diffusion whose payoff depends on a linear parameter. As shown in [Bank and Föllmer(2003)] problems of this type may allow for a universal stopping signal that characterizes optimal stopping times for any given parameter via a level-crossing principle of some auxiliary process. For regular one-dimensional diffusions,...
متن کاملOptimal Stopping Problems
In the last lecture, we have analyzed the behavior of TD(λ) for approximating the costtogo function in autonomous systems. Recall that much of the analysis was based on the idea of sampling states according to their stationary distribution. This was done either explicitly, as was assumed in approximate value iteration, or implicitly through the simulation or observation of system trajectories...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Теория вероятностей и ее применения
سال: 2003
ISSN: 0040-361X
DOI: 10.4213/tvp270